Minimizing maximum indegree
نویسندگان
چکیده
منابع مشابه
Minimizing Maximum Flow-time on Related Machines
We consider the online problem of minimizing the maximum flow-time on related machines. This is a natural generalization of the extensively studied makespan minimization problem to the setting where jobs arrive over time. Interestingly, natural algorithms such as Greedy or Slow-fit that work for the simpler identical machines case or for makespan minimization on related machines, are not O(1)-c...
متن کاملMinimizing a stochastic maximum-reliability path
We consider a stochastic network interdiction problem in which the goal is to detect an evader, who selects a maximum-reliability path. Subject to a resource constraint, the interdictor installs sensors on a subset of the network’s arcs to minimize the value of the evader’s maximum-reliability path, i.e., to maximize the detection probability. When this decision is made, the evader’s origin–des...
متن کاملMinimizing the Maximum Starting Time On-line
We study the scheduling problem of minimizing the maximum starting time on-line. The goal is to minimize the last time that a job starts. We show that while the greedy algorithm has a competitive ratio of (logm), we can give a constant competitive algorithm for this problem. We also show that the greedy algorithm is optimal for resource augmentation in the sense that it requires 2m 1 machines t...
متن کاملMinimizing the Maximum Interference is Hard
We consider the following interference model for wireless sensor and ad hoc networks: the receiver interference of a node is the number of transmission ranges it lies in. We model transmission ranges as disks. For this case we show that choosing transmission radii which minimize the maximum interference while maintaining a connected symmetric communication graph is NP-complete.
متن کاملCounting labelled trees with given indegree sequence
For a labelled tree on the vertex set [n] := {1, 2, . . . , n}, define the direction of each edge ij to be i → j if i < j. The indegree sequence of T can be considered as a partition λ ⊢ n − 1. The enumeration of trees with a given indegree sequence arises in counting secant planes of curves in projective spaces. Recently Ethan Cotterill conjectured a formula for the number of trees on [n] with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/j.dam.2003.07.007